Ju n 20 02 Restart method and exponential acceleration of random 3 - SAT instances resolutions : a large deviation analysis of the Davis – Putnam – Loveland – Logemann algorithm
نویسندگان
چکیده
The analysis of the solving complexity of random 3-SAT instances using the Davis-Putnam-Loveland-Logemann (DPLL) algorithm slightly below threshold is presented. While finding a solution for such instances demands exponential effort with high probability, we show that an exponentially small fraction of resolutions require a computation scaling linearly in the size of the instance only. We compute analytically this exponentially small probability of easy resolutions from a large deviation analysis of DPLL with the Generalized Unit Clause search heuristic, and show that the corresponding exponent is smaller (in absolute value) than the growth exponent of the typical resolution time. Our study therefore gives some quantitative basis to heuristic restart solving procedures, and suggests a natural cut-off cost (the size of the instance) for the restart.
منابع مشابه
Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: a large deviation Analysis Of The . . .
متن کامل
an 2 00 4 Heuristic average - case analysis of the backtrack resolution of random 3 - Satisfiability instances
An analysis of the average-case complexity of solving random 3-Satisfiability (SAT) instances with backtrack algorithms is presented. We first interpret previous rigorous works in a unifying framework based on the statistical physics notions of dynamical trajectories, phase diagram and growth process. It is argued that, under the action of the Davis–Putnam–Loveland–Logemann (DPLL) algorithm, 3-...
متن کاملHeuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances
An analysis of the average-case complexity of solving random 3-Satisfiability (SAT) instances with backtrack algorithms is presented. We first interpret previous rigorous works in a unifying framework based on the statistical physics notions of dynamical trajectories, phase diagram and growth process. It is argued that, under the action of the Davis–Putnam–Loveland–Logemann (DPLL) algorithm, 3-...
متن کاملGolden Rules for Building Effective SAT Solvers
The area of Propositional Satisfiability (SAT) has been the subject of intensive research in recent years, with significant theoretical and practical contributions. From a practical perspective, a large number of very effective SAT solvers have recently been proposed, most of which based on improvements made to the original Davis-Putnam-Logemann-Loveland (DPLL) backtrack search SAT algorithm. T...
متن کاملExponential Lower Bounds for a DPLL Attack against a One-Way Function Based on Expander Graphs
Oded Goldreich’s 2000 paper “Candidate One-Way Functions Based on Expander Graphs” [4] describes a function that employs a fixed random predicate and an expander graph. Goldreich conjectures that this function is difficult to invert, but this difficulty does not seem to stem from any standard assumption in Complexity Theory. The task of inverting Goldreich’s function reduces naturally to a SAT ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002